Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation

نویسندگان

  • Pierre Flener
  • Justin Pearson
چکیده

Airspace sectorisation provides a partition of a given airspace into sectors, subject to geometric constraints and workload constraints, so that some cost metric is minimised. We make a study of the constraints that arise in airspace sectorisation. For each constraint, we give an analysis of what algorithms and properties are required under systematic search and stochastic local search.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Airspace Sectorisation: A Survey

Airspace sectorisation provides a partition of a given airspace into sectors, subject to geometric constraints and workload constraints, so that some cost metric is minimised. We survey the algorithmic aspects of methods for automatic airspace sectorisation, for an intended readership of experts on air traffic management.

متن کامل

Balancing Controllers’ Workload by Locally Redesigning Airspace Sectors

We study an Airspace Resectorization Problem (ARP). A sectorization is a subdivision of an airspace into sectors, each managed by an airtraffic controller. A wellbalanced sectorization is a sectorization that distributes the workload evenly among the controllers. We discuss the problem of generating optimal sectorizations and describe GeoSect-Local, a tool that improves a given sectorization by...

متن کامل

Optimized Sectorization of Airspace with Constraints

In this paper we consider the Optimized Airspace Sectorization Problem (ASP) with constraints in which a given airspace is to be partitioned into a number of sectors. The objective of ASP is to minimize the coordination workload between adjacent sectors. We proposed a constraint programming approach to optimize the sectorization that shall satisfy all specific constraints e.g. the controllers’ ...

متن کامل

Geometric Algorithms for the Airspace Sectorization Problem

The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the airspace is partitioned into approximately 600 sectors; each sector is observed by a single controller. In order to satisfy workload limitations for controllers, it is important that sectors be designed carefully accord...

متن کامل

Turn-Constrained Route Planning for Avoiding Hazardous Weather

We investigate the problem of algorithmically synthesizing turn-constrained routes that minimize exposure to hazardous weather. Such a problem is suitable to air traffic management automation and aircraft flight management systems. Our algorithm synthesizes routes that aircraft may follow from a specified start to finish location. Example applications include synthesizing routes (1) from airpor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1401.7463  شماره 

صفحات  -

تاریخ انتشار 2014